A CONGRUENCE IDENTITY SATISFIED BY m-PERMUTABLE VARIETIES

نویسنده

  • PAOLO LIPPARINI
چکیده

We present a new and useful congruence identity satisfied by m-permutable varieties. It has been proved in [L1] that every m-permutable variety satisfies a non-trivial lattice identity (depending only on m). In [L2] we have found another interesting identity: Theorem 1. For m ≥ 3, every m-permutable variety satisfies the congruence identity αβh = αγh, for h = m[ m+1 2 ]− 1 Here, [ ] denotes integer part, and βh, γh are defined as usual: β0 = γ0 = 0, βn+1 = β + αγn, γn+1 = γ + αβn. The proof of Theorem 1 consists of two steps. As for the second step, it is an easy application of commutator theory, but in the present note we shall be concerned only with the first step. The first step is a commutator-free proof of the following Theorem 2. If every subalgebra of A is m-permutable then A satisfies (Xm). More generally: (i) If every congruence of A, thought of as a subalgebra of A, is m-permutable then A satisfies (Xm). (ii) If every subalgebra of A generated by m + 1 elements is mpermutable then A satisfies (Xm); actually, A satisfies the stronger version of (Xm) in which α is only supposed to be a compatible relation on A, and δ is any relation on A. In the statement of Theorem 2 we have used: 2000 Mathematics Subject Classification. 08A30, 08B05.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

IDEMPOTENT n-PERMUTABLE VARIETIES

One of the important classes of varieties identified in tame congruence theory is the class of varieties which are n-permutable for some n. In this paper we prove two results: (1) For every n > 1 there is a polynomial-time algorithm which, given a finite idempotent algebra A in a finite language, determines whether the variety generated by A is n-permutable; (2) A variety is n-permutable for so...

متن کامل

Varieties Whose Tolerances Are Homomorphic Images of Their Congruences

The homomorphic image of a congruence is always a tolerance (relation) but, within a given variety, a tolerance is not necessarily obtained this way. By a Maltsev-like condition, we characterize varieties whose tolerances are homomorphic images of their congruences (TImC). As corollaries, we prove that the variety of semilattices, all varieties of lattices, and all varieties of unary algebras h...

متن کامل

QUASISHEFFER OPERATIONS AND k-PERMUTABLE ALGEBRAS

A well known theorem of Murskiı̆’s asserts that almost every finite, nonunary algebra is idemprimal. We derive an analagous result under the assumption that all basic operations are idempotent. If the algebra contains a basic l-ary idempotent operation with l > 2 then the algebra is idemprimal with probability 1. However, for an algebra with a single basic binary operation, the probability of id...

متن کامل

Principal and Syntactic Congruences in Congruence-distributive and Congruence-permutable Varieties

We give a new proof that a finitely generated congruence-distributive variety has finitely determined syntactic congruences (or equivalently, term finite principal congruences), and show that the same does not hold for finitely generated congruence-permutable varieties, even under the additional assumption that the variety is residually very finite. 2000 Mathematics subject classification: 08B10.

متن کامل

Critical Algebras and the Frattini Congruence

In this note we show that if two critical algebras generate the same congruence-permutable variety, then the varieties generated by their proper sections also coincide.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005